url = 'https://www.acwing.com/problem/content/850/'

import sys
from collections import deque

N = 100010

h = [-1] * N
e = [0] * N
ne = [0] * N
d = [0] * N
q = [0] * N

idx = 0

def add(a, b):
    global idx
    e[idx], ne[idx], h[a] = b, h[a], idx
    idx += 1

def topsort():
    hh, tt = 0, -1

    for i in range(1, n + 1):
        if not d[i]:
            tt += 1
            q[tt] = i

    while hh <= tt:
        t = q[hh]
        hh += 1

        i = h[t]
        while i != -1:
            j = e[i]
            d[j] -= 1
            if not d[j]:
                tt += 1
                q[tt] = j
            i = ne[i]

    return tt == n - 1

n, m = map(int, sys.stdin.readline().split())

for i in range(m):
    a, b = map(int, sys.stdin.readline().split())
    add(a, b)
    d[b] += 1

if not topsort():
    print("-1")
else:
    for i in range(n):
        print(q[i], end=" ")
    print()
